Complex University Timetabling Using Iterative Forward Search Algorithm and Great Deluge Algorithm

University timetabling is an issue that has received more attention in the field of operations research. Course scheduling process arranging time slots and room for a class by paying to existing limitations. This problem NP-Hard problem, which means computation find solution increases exponentially with size problem. Solutions problems this kind generally use heuristic approach, tries sufficiently good (not necessarily optimal) reasonable time. We go through two stages solving The first stage schedule all classes without breaking any predefined rules. second optimizes timetable generated stage. study attempts solve issued competition called 2019 International Timetabling Competition (ITC 2019). In stage, we Iterative Forward Search (IFS) algorithm eliminate candidates generate schedule. employ Great Deluge hyper-heuristic approach optimize produced have tested method using 30 datasets taking 1,000,000 iterations on each dataset. result application does elimination uses IFS produce not violate hard constraints ITC datasets. implementation schedules average penalty reduction 42%.